Convexity preserving interpolation by splines of arbitrary degree
نویسنده
چکیده
In the present paper an algorithm of C interpolation of discrete set of data is given using splines of arbitrary degree, which preserves the convexity of given set of data. Mathematics Subject Classification 2000: 65D05, 65D07, 41A05, 41A15.
منابع مشابه
Constrained Interpolation via Cubic Hermite Splines
Introduction In industrial designing and manufacturing, it is often required to generate a smooth function approximating a given set of data which preserves certain shape properties of the data such as positivity, monotonicity, or convexity, that is, a smooth shape preserving approximation. It is assumed here that the data is sufficiently accurate to warrant interpolation, rather than least ...
متن کاملConvex Interpolation by Splines of Arbitrary Degree
An algorithm is described for computing an interpolation spline of arbitrary but fixed degree which preserves the convexity of the given data set. Necessary and sufficient conditions for the solvability of the problem, some special cases and error estimations are given.
متن کاملShape-preserving interpolation by splines using vector subdivision
We give a local convexity preserving interpolation scheme using parametric 2 C cubic splines with uniform knots produced by a vector subdivision scheme which simultaneously provides the function and its first and second order derivatives. This is also adapted to give a scheme which is both local convexity and local monotonicity preserving when the data values are strictly increasing in the x di...
متن کاملOn Convexity Preserving C1 Hermite Spline Interpolation
The aim of this paper is to present a general approach to the problem of shape preserving interpolation. The problem of convexity preserving interpolation using C Hermite splines with one free generating function is considered.
متن کاملConvexity preserving splines over triangulations
A general method is given for constructing sets of sufficient linear conditions that ensure convexity of a polynomial in Bernstein–Bézier form on a triangle. Using the linear conditions, computational methods based on macro-element spline spaces are developed to construct convexity preserving splines over triangulations that interpolate or approximate given scattered data.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- The Computer Science Journal of Moldova
دوره 18 شماره
صفحات -
تاریخ انتشار 2010